Hilbert Series of Group Representations and Grr Obner Bases for Generic Modules
نویسنده
چکیده
Each matrix representation : G ?! GL n (K) of a nite group G over a eld K induces an action of G on the module A n over the polynomial algebra A = Kx 1 ; ; x n ]. The graded A-submodule M() of A n generated by the orbit of (x 1 ; ; x n) is studied. A decomposition of M() into generic modules is given. Relations between the numerical invariants of and those of M(), the later being eeciently computable by Grr obner bases methods, are examined. It is shown that if is multiplicity-free, then the dimensions of the irreducible constituents of can be read oo from the Hilbert series of M(). It is proved that determinantal relations form Grr obner bases for the syzygies on generic matrices with respect to any lexicographic order. Grr obner bases for generic modules are also constructed, and their Hilbert series are derived. Consequently, the Hilbert series of M() is obtained for an arbitrary representation.
منابع مشابه
Noncommutative Grr Obner Bases. a Computational and Theoretical Tool
Overview These notes consists of ve lectures. Each lecture covers the material that I will present with fuller details and exercises. I have also included some material in appendices which the reader might nd interesting but which I will not have time to cover in my lectures. Lecture 1 introduces both linear Grr obner bases and Grr obner bases for algebras. Lecture 2 surveys some of the basis a...
متن کاملMonomial Representations for Grr Obner Bases Computations
Monomial representations and operations for Grr obner bases computations are investigated from an implementation point of view. The technique of vectorized monomial operations is introduced and it is shown how it expedites computations of Grr obner bases. Furthermore, a rank-based monomial representation and comparison technique is examined and it is concluded that this technique does not yield...
متن کامل1 HOW TO USE GR OBNER - MATHEMATICA 2 Global Variable Semantics Possible Values
In this paper we report on GR OBNER-Mathematica, an experimental implementation for computing Grr obner bases in Mathematica. This implementation in its current form ooers three diierent versions of the Grr obner bases algorithm and is generic with respect to the ordering of power products, the domain of coeecients of the polynomials, and the representation of power products, monomials, polynom...
متن کاملComputing Grr Obner Bases by Fglm Techniques in a Noncommutative Setting
A generalization of the FGLM technique is given to compute Grr obner bases for two-sided ideals of free nitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) presentations. Generalizations are discussed in order to compute G-bases on (twisted) semigroup rings. It is well known that the co...
متن کاملGrr Obner Bases, Invariant Theory and Equivariant Dynamics
This paper is about algorithmic invariant theory as it is required within equivari-ant dynamical systems. The question of generic bifurcation equations requires the knowledge of fundamental invariants and equivariants. We discuss computations which are related to this for nite groups and semisimple Lie groups. We consider questions such as the completeness of invariants and equivariants. EEcien...
متن کامل